All cycle-complete graph Ramsey numbers r(Cm, K6)
نویسنده
چکیده
The cycle-complete graph Ramsey number r (Cm,Kn ) is the smallest integer N such that every graph G of order N contains a cycle Cm on m vertices or has independence number (G) n. It has been conjectured by Erdős, Faudree, Rousseau and Schelp that r (Cm,Kn )1⁄4 (m 1) (n 1)þ 1 for all m n 3 (except r (C3,K3 )1⁄4 6). This conjecture holds for 3 n 5: In this paper we will present a proof for n 1⁄4 6 and for all n 7 with m n 2n. 2003 Wiley Periodicals, Inc. J Graph Theory 44: 251–260, 2003
منابع مشابه
Multicolor Ramsey Numbers for Paths and Cycles
For given graphs G1, G2, . . . , Gk, k ≥ 2, the multicolor Ramsey number R(G1, G2, . . . , Gk) is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors, then it is always a monochromatic copy of some Gi, for 1 ≤ i ≤ k. We give a lower bound for k-color Ramsey number R(Cm, Cm, . . . , Cm), where m ≥ 8 is even and Cm is the cycle on m...
متن کاملThe Ramsey numbers for a cycle of length six or seven versus a clique of order seven
For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G2. Let Cm denote a cycle of length m and Kn a complete graph of order n. It was conjectured that R(Cm,Kn) = (m−1)(n−1)+1 form ≥ n ≥ 3 and (m,n) 6= (3, 3). We show that R(C6,K7) = 31 and R(C7,K7) = 37, and the latter res...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملOn cycle - Complete graph ramsey numbers
A new upper bound is given for the cycle-complete graph Ramsey number r(C,,,, K„), the smallest order for a graph which forces it to contain either a cycle of order m or a set of ri independent vertices . Then, another cycle-complete graph Ramsey number is studied, namely r( :C,,,, K„) the smallest order for a graph which forces it to contain either a cycle of order 1 for some I satisfying 3 :1...
متن کاملA note on Ramsey numbers with two parameters
1 The Ramsey number R(G1,G2) is the smallest integer p such that for any graph G on p vertices 2 either G contains G1 or G contains G2, where G denotes the complement of G. In this paper, some 3 new bounds with two parameters for the Ramsey number R(G1,G2), under some assumptions, are 4 obtained. Especially, we prove that R(K6 − e, K6) ≤ 116 and R(K6 − e, K7) ≤ 202, these improve 5 the two uppe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 44 شماره
صفحات -
تاریخ انتشار 2003